Combinatorial optimization and application to DNA sequence analysis
نویسنده
چکیده
iii ACKNOWLEDGEMENTS I would like to express my sincere gratitude to everyone who assisted in the completion of this thesis, both directly and indirectly. First and foremost, I would like to thank my advisor, Dr. Eva K. Lee. I am deeply grateful to her for constant guidance, inspiration, financial support, and encouragement throughout my stay at Georgia Tech.
منابع مشابه
Optimization of the Analysis of Almond DNA Simple Sequence Repeats (SSRs) Through Submarine Electrophoresis Using Different Agaroses and Staining Protocols
Simple sequence repeat (SSR markers or microsatellites), based on the specific PCR amplification of DNA sequences, are becoming the markers of choice for molecular characterization of a wide range of plants because of their high polymorphism, abundance, and codominant inheritance. Different methods have been used for the analysis of the SSR amplified fragments being submarine agarose electropho...
متن کاملParallelizing Assignment Problem with DNA Strands
Background:Many problems of combinatorial optimization, which are solvable only in exponential time, are known to be Non-Deterministic Polynomial hard (NP-hard). With the advent of parallel machines, new opportunities have been emerged to develop the effective solutions for NP-hard problems. However, solving these problems in polynomial time needs massive parallel machines and ...
متن کاملAn Exact Mathematical Programming Approach to Multiple RNA Sequence-Structure Alignment
One of the main tasks in computational biology is the computation of alignments of genomic sequences to reveal their commonalities. In case of DNA or protein sequences, sequence information alone is usually sufficient to compute reliable alignments. RNA molecules, however, build spatial conformations—the secondary structure—that are more conserved than the actual sequence. Hence, computing reli...
متن کاملSome Results about the Contractions and the Pendant Pairs of a Submodular System
Submodularity is an important property of set functions with deep theoretical results and various applications. Submodular systems appear in many applicable area, for example machine learning, economics, computer vision, social science, game theory and combinatorial optimization. Nowadays submodular functions optimization has been attracted by many researchers. Pendant pairs of a symmetric...
متن کاملLot Streaming in No-wait Multi Product Flowshop Considering Sequence Dependent Setup Times and Position Based Learning Factors
This paper considers a no-wait multi product flowshop scheduling problem with sequence dependent setup times. Lot streaming divide the lots of products into portions called sublots in order to reduce the lead times and work-in-process, and increase the machine utilization rates. The objective is to minimize the makespan. To clarify the system, mathematical model of the problem is presented. Sin...
متن کامل